Bayesian Quickest Change-Point Detection With Sampling Right Constraints
نویسندگان
چکیده
منابع مشابه
Non-Bayesian Quickest Detection with Stochastic Sample Right Constraints
In this paper, we study the design and analysis of optimal detection scheme for sensors that are deployed to monitor the change in the environment and are powered by the energy harvested from the environment. In this type of applications, detection delay is of paramount importance. We model this problem as quickest change detection problem with a stochastic energy constraint. In particular, a w...
متن کاملBayesian Quickest Transient Change Detection
We consider the problem of quickest transient change detection under a Bayesian setting. The change occurs at a random time Γ1 and disappears at a random time Γ2 > Γ1. Thus, at any time k, the system can be in one of the following states, i) prechange, ii) in–change, and iii) out–of–change. We model the evolution of the state by a Markov chain. The state of the system can only be observed parti...
متن کاملMulti-Chart Detection Procedure for Bayesian Quickest Change-Point Detection with Unknown Post-Change Parameters
In this paper, the problem of quickly detecting an abrupt change on a stochastic process under Bayesian framework is considered. Different from the classic Bayesian quickest change-point detection problem, this paper considers the case where there is uncertainty about the post-change distribution. Specifically, the observer only knows that the post-change distribution belongs to a parametric di...
متن کاملon the bayesian sequential change-point detection
the problems of sequential change-point have several important applications in quality control, signal processing, and failure detection in industry and finance. we discuss a bayesian approach in the context of statistical process control: at an unknown time $tau$, the process behavior changes and the distribution of the data changes from p0 to p1. two cases are considered: (i) p0 and p1 are fu...
متن کاملGeneral Asymptotic Bayesian Theory of Quickest Change Detection
The optimal detection procedure for detecting changes in independent and identically distributed (i.i.d.) sequences in a Bayesian setting was derived by Shiryaev in the 1960s. However, the analysis of the performance of this procedure in terms of the average detection delay and false alarm probability has been an open problem. In this paper, we develop a general asymptotic change-point detectio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2341607